Optimal Explicit Strong-Stability-Preserving General Linear Methods

نویسندگان

  • Emil M. Constantinescu
  • Adrian Sandu
چکیده

This paper constructs strong-stability-preserving general linear time-stepping methods that are well suited for hyperbolic PDEs discretized by the method of lines. These methods generalize both Runge-Kutta (RK) and linear multistep schemes. They have high stage orders and hence are less susceptible than RK methods to order reduction from source terms or nonhomogeneous boundary conditions. A global optimization strategy is used to find the most efficient schemes that have low storage requirements. Numerical results illustrate the theoretical findings.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computation of optimal monotonicity preserving general linear methods

Monotonicity preserving numerical methods for ordinary differential equations prevent the growth of propagated errors and preserve convex boundedness properties of the solution. We formulate the problem of finding optimal monotonicity preserving general linear methods for linear autonomous equations, and propose an efficient algorithm for its solution. This algorithm reliably finds optimal meth...

متن کامل

Optimal Explicit Strong - Stability - Preserving

This paper constructs strong-stability-preserving general linear time-stepping methods that are well suited for hyperbolic PDEs discretized by the method of lines. These methods generalize both Runge–Kutta (RK) and linear multistep schemes. They have high stage orders and hence are less susceptible than RK methods to order reduction from source terms or nonhomogeneous boundary conditions. A glo...

متن کامل

Ju n 20 06 Implicit - explicit methods based on strong stability preserving multistep time discretizations ⋆

In this note we propose and analyze novel implicit-explicit methods based on second order strong stability preserving multistep time discretizations. Several schemes are developed, and a linear stability analysis is performed to study their properties with respect to the implicit and explicit eigenvalues. One of the proposed schemes is found to have very good stability properties, with implicit...

متن کامل

Implicit - explicit methods based on strong stability preserving multistep time discretizations ⋆ Thor

In this note we propose and analyze novel implicit-explicit methods based on second order strong stability preserving multistep time discretizations. Several schemes are developed, and a linear stability analysis is performed to study their properties with respect to the implicit and explicit eigenvalues. One of the proposed schemes is found to have very good stability properties, with implicit...

متن کامل

Strong Stability-Preserving High-Order Time Discretization Methods

In this paper we review and further develop a class of strong-stability preserving (SSP) high-order time discretizations for semi-discrete method-of-lines approximations of partial di erential equations. Termed TVD (total variation diminishing) time discretizations before, this class of high-order time discretization methods preserves the strong-stability properties of rst-order Euler time step...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 32  شماره 

صفحات  -

تاریخ انتشار 2010